A rigorous procedure for generating a well-ordered Set of Reals without use of Axiom of Choice / Well-Ordering Theorem
نویسنده
چکیده
Well-ordering of the Reals presents a major challenge in Set theory. Under the standard Zermelo Fraenkel Set theory (ZF) with the Axiom of Choice (ZFC), a well-ordering of the Reals is indeed possible. However the Axiom of Choice (AC) had to be introduced to the original ZF theory which is then shown equivalent to the well-ordering theorem. Despite the result however, no way has still been found of actually constructing a well-ordered Set of Reals. In this paper the author attempts to generate a well ordered Set of Reals without using the AC i.e. under ZF theory itself using the Axiom of the Power Set as the guiding principle. Introduction: In this paper, the author attempts a well-ordering of the Reals. Specifically the wellordering in achieved in the closed interval 1 , 0 . This does not in any way loose generality as the Set of Reals in the open interval 1 , 0 is equinumerous with the Set of Reals in , via the tangent function 2 tan x . As stated, well-ordering of the Reals presents a major challenge in Set theory. The most popular version of Axiomatic Set theory is the Zermelo Fraenkel Set theory (ZF) with the Axiom of Choice (ZFC). Under this theory a well-ordering of the Reals is indeed possible. However, a new Axiom, the Axiom of Choice (AC) had to be appended to the original axioms of ZF theory for this purpose. The Axiom of Choice is shown to be equivalent to Zorn’s lemma and the well-ordering theorem [1]. The wellordering theorem simply states that every Set can be well-ordered. The Axiom of Choice, though largely accepted by most mathematicians still retains a few detractors as the AC can establish the existence of certain Sets without actually specifying any way of constructing them. Even for those whose unquestionably accept the AC, any proof given using just ZF theory is considered in some sense ‘superior’ to the same proof given using ZFC. Coming back to the problem at hand, it is to be realized that although a well-ordering of the Reals is possible in ZFC, this remains very much an in-
منابع مشابه
The Axiom of Choice for Well-Ordered Families and for Familes of Well-Orderable Sets
We show that it is not possible to construct a Fraenkel-Mostowski model in which the axiom of choice for well ordered families of sets and the axiom of choice for sets for well orderable sets are both true, but the axiom of choice is false. We are concerned with the following two consequences of the axiom of choice: C(WO,∞): Every well ordered collection of sets has a choice function. C(∞,WO): ...
متن کاملThe Hahn-banach Theorem Implies the Existence of a Non Lebesgue-measureable Set
Few methods are known to construct nonLebesgue-measurable sets of reals: most standard ones start from a well-ordering of R, or from the existence of a non-trivial ultrafilter over ω, and thus need the axiom of choice AC or at least the Boolean Prime Ideal theorem (BPI see [5]). In this paper we present a new way for proving the existence of non-measurable sets using a convenient operation of a...
متن کاملThe Hahn-banach Theorem Implies the Existence of a Non Lebesgue-measurable Set
§0. Introduction. Few methods are known to construct non Lebesgue-measurable sets of reals: most standard ones start from a well-ordering of R, or from the existence of a non-trivial ultrafilter over ω, and thus need the axiom of choice AC or at least the Boolean Prime Ideal theorem BPI (see [5]). In this paper we present a new way for proving the existence of non-measurable sets using a conven...
متن کاملParacompactness of Metric Spaces and the Axiom of Multiple Choice
The axiom of multiple choice implies that metric spaces are paracompact but the reverse implication cannot be proved in set theory without the axiom of choice. 1. Background, Definitions and Summary of Results. Working in set theory without the axiom of choice we study the deductive strength of the assertion MP: Metric spaces are paracompact. (Definitions are given below.) MP was first proved i...
متن کاملRestricting the parameter set of the Pascoletti-Serafini scalarization
A common approach to determine efficient solutions of a multiple objective optimization problem is reformulating it to a parameter dependent scalar optimization problem. This reformulation is called scalarization approach. Here, a well-known scalarization approach named Pascoletti-Serafini scalarization is considered. First, some difficulties of this scalarization are discussed and then ...
متن کامل